Simple eigenvalues of cubic vertex-transitive graphs
نویسندگان
چکیده
Abstract If ${\mathbf v} \in {\mathbb R}^{V(X)}$ is an eigenvector for eigenvalue $\lambda $ of a graph X and $\alpha automorphism , then ({\mathbf v})$ also . Thus, it rather exceptional vertex-transitive to have multiplicity one. We study cubic graphs with nontrivial simple eigenvalue, discover remarkable connections arc-transitivity, regular maps, number theory.
منابع مشابه
Semiregular Automorphisms of Cubic Vertex Transitive Graphs
It is shown that for a connected cubic graph Γ , a vertex transitive group G ≤ AutΓ contains a large semiregular subgroup. This confirms a conjecture of Cameron and Sheehan (2001).
متن کاملSemiregular Automorphisms of Cubic Vertex-transitive Graphs
We characterise connected cubic graphs admitting a vertextransitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a semiregular subgroup of maximum order in a vertex-transitive group of automorphisms of a connected cubic graph grows with the order of the graph, settling [2, Problem ...
متن کاملSemiregular automorphisms of vertex-transitive cubic graphs
An old conjecture of Marušič, Jordan and Klin asserts that any finite vertextransitive graph has a non-trivial semiregular automorphism. Marušič and Scapellato proved this for cubic graphs. For these graphs, we make a stronger conjecture, to the effect that there is a semiregular automorphism of order tending to infinity with n. We prove that there is one of order greater than 2.
متن کاملEfficient domination in cubic vertex-transitive graphs
An independent set of vertices S of a graph dominates the graph efficiently if every vertex of the graph is either in S or has precisely one neighbour in S. In this paper we prove that a connected cubic vertex-transitive graph on a power of 2 vertices has a set that dominates it efficiently if and only if it is not isomorphic to a Möbius ladder. This is a preprint of an article accepted for pub...
متن کاملCubic Vertex-Transitive Non-Cayley Graphs of Order 8p
A graph is vertex-transitive if its automorphism group acts transitively on its vertices. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, the cubic vertextransitive non-Cayley graphs of order 8p are classified for each prime p. It follows from this classification that there are two sporadic and two infini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Journal of Mathematics
سال: 2023
ISSN: ['1496-4279', '0008-414X']
DOI: https://doi.org/10.4153/s0008414x23000482